Finding acceptable models in nonlinear inverse problems using a neighbourhood algorithm

نویسندگان

  • Malcolm Sambridge
  • M Sambridge
چکیده

A recently proposed new class of direct search method is applied to the problem of mapping out the region of data-acceptable models (sets of unknowns) in a finite-dimensional nonlinear inverse problem. A model is defined to be data acceptable if its fit to the observed data is better than some prescribed level. The neighbourhood algorithm (NA) can be used to generate ensembles of models which preferentially sample the data-acceptable regions of parameter space. Simple transformations of a data misfit criterion are proposed to assist in this task. Some numerical experiments are presented which are motivated by highly nonlinear geophysical inverse problems. In these cases it is shown how the NA can be used to map out the main features of data-acceptable regions in both highand low-dimensional problems. It is also shown how the NA can concentrate sampling in multiple acceptable regions simultaneously.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Fourier heat conduction equation in a sphere; comparison of variational method and inverse Laplace transformation with exact solution

Small scale thermal devices, such as micro heater, have led researchers to consider more accurate models of heat in thermal systems. Moreover, biological applications of heat transfer such as simulation of temperature field in laser surgery is another pathway which urges us to re-examine thermal systems with modern ones. Non-Fourier heat transfer overcomes some shortcomings of Fourier heat tran...

متن کامل

A regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method

The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...

متن کامل

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

ESTIMATION OF INVERSE DYNAMIC BEHAVIOR OF MR DAMPERS USING ARTIFICIAL AND FUZZY-BASED NEURAL NETWORKS

In this paper the performance of Artificial Neural Networks (ANNs) and Adaptive Neuro- Fuzzy Inference Systems (ANFIS) in simulating the inverse dynamic behavior of Magneto- Rheological (MR) dampers is investigated. MR dampers are one of the most applicable methods in semi active control of seismic response of structures. Various mathematical models are introduced to simulate the dynamic behavi...

متن کامل

AN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS

The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001